Cycles of given lengths in unicyclic components in sparse random graphs

نویسندگان

چکیده

Let L be subset of {3,4,…} and let Xn,M(L) the number cycles belonging to unicyclic components whose length is in random graph G(n,M). We find limiting distribution subcritical regime M=cn with c<1/2 critical M=n2(1+μn−1/3) μ=O(1). Depending on a condition involving series ∑ℓ∈Lzℓ/(2ℓ), we obtain limit either Poisson or normal as n→∞.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cycles And Unicyclic Components In Random Graphs

The sizes of the cycles and unicyclic components in the random graph G(n, n/2 ± s), where n ≪ s ≪ n, are studied using the language of point processes. This refines several earlier results by different authors. Asymptotic distributions of various random variables are given; these distributions include the gamma distributions with parameters 1/4, 1/2 and 3/4, as well as the Poisson–Dirichlet and...

متن کامل

Unicyclic Components in Random Graphs

Random graphs underly processes such as polymerization [1], percolation [2], and the formation of social networks [3, 4]. Random graphs have been extensively studied, especially in theoretical computer science [5, 6]. Special families of random graphs have been also examined, e.g., planar random graphs appear in combinatorics [7, 8] and in physics [9]. The basic framework for generic random gra...

متن کامل

Cycle lengths in sparse graphs

Let C(G) denote the set of lengths of cycles in a graph G. In the first part of this paper, we study the minimum possible value of |C(G)| over all graphs G of average degree d and girth g. Erdős [7] conjectured that |C(G)| = Ω ( d ) for all such graphs, and we prove this conjecture. We also show that this is a lower bound for the number of odd cycle lengths in a graph of chromatic number d and ...

متن کامل

Induced subgraphs in sparse random graphs with given degree sequences

Let Gn,d denote the uniformly random d-regular graph on n vertices. For any S ⊂ [n], we obtain estimates of the probability that the subgraph of Gn,d induced by S is a given graph H. The estimate gives an asymptotic formula for any d = o(n1/3), provided that H does not contain almost all the edges of the random graph. The result is further extended to the probability space of random graphs with...

متن کامل

Induced subgraphs in sparse random graphs with given degree sequence

Let Gn,d denote the uniformly random d-regular graph on n vertices. For any S ⊂ [n], we obtain estimates of the probability that the subgraph of Gn,d induced by S is a given graph H. The estimate gives an asymptotic formula for any d = o(n1/3), provided that H does not contain almost all the edges of the random graph. The result is further extended to the probability space of random graphs with...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Applied Mathematics

سال: 2021

ISSN: ['1090-2074', '0196-8858']

DOI: https://doi.org/10.1016/j.aam.2020.102162